A tableau algorithm for reasoning about on epts
نویسندگان
چکیده
منابع مشابه
A Tableau Algorithm for Linear-Time Temporal Logic with Constraints
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal logics in the presence of such constraints. First, we provide experimental results from a developed prover for a tableau-like algorithm with constraints, showing the advantages of this method over other tableau provers. Ho...
متن کاملExploring Parallelization of Conjunctive Branches in Tableau-Based Description Logic Reasoning
Multiprocessor equipment is cheap and ubiquitous now, but users of description logic (DL) reasoners have to face the awkward fact that the major tableau-based DL reasoners can make use only one of the available processors. Recently, researchers have started investigating how concurrent computing can play a role in tableau-based DL reasoning with the intention of fully exploiting the processing ...
متن کاملTableau-Based ABox Abduction for Description Logics: Preliminary Report
ABox abduction is an important reasoning problem for description logics (DL) with applications in diagnosis, manufacturing control, multimedia interpretation, etc. Several abductive reasoners for DL were designed and implemented using a translation to first-order logic or logic programming. Algorithms for ABox abduction based directly on native DL reasoning techniques, such as tableau algorithm...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملReasoning about distances
The paper presents a novel expressive logic-based formalism intended for reasoning about numerical distances. We investigate its computational properties (in particular, show that it is EXPTIMEcomplete) and devise a tableau-based satisfiabilitychecking algorithm. To be able to express knowledge about implicit or unknown distances, we then extend the language with variables ranging over distance...
متن کامل